Strong Gaussian approximation of metastable density-dependent Markov chains on large time scales
نویسندگان
چکیده
We consider density-dependent Markov chains converging, as the scale parameter K>0 goes to infinity, solution of an ODE admitting exponentially stable equilibrium point. provide a new strong approximation density by Gaussian process, based on construction Kurtz using Komlós–Major–Tusnády theorem. show that given any threshold ?(K)?1 greater than multiple log(K)/K, time error needs reach ?(K) is at least order exp(VK?(K)), for some V>0. discuss consequences moderate deviations, applications logistic birth-and-death process conditioned survive and epidemic model.
منابع مشابه
effect of sub-grid scales on large eddy simulation of particle deposition in a turbulent channel flow
چکیده ندارد.
15 صفحه اولApproximation of discrete-time polling systems via structured Markov chains
We devise an approximation of the marginal queue length distribution in discrete-time polling systems with batch arrivals and fixed packet sizes. The polling server uses the Bernoulli service discipline and Markovian routing. The 1-limited and exhaustive service disciplines are special cases of the Bernoulli service discipline, and traditional cyclic routing is a special case of Markovian routi...
متن کاملApplying Mean-Field Approximation to Continuous Time Markov Chains
The mean-field analysis technique is used to perform analysis of a systems with a large number of components to determine the emergent deterministic behaviour and how this behaviour modifies when its parameters are perturbed. The computer science performance modelling and analysis community has found the mean-field method useful for modelling large-scale computer and communication networks. App...
متن کاملAn Svd Approach to Identifying Metastable States of Markov Chains
Abstract. Being one of the key tools in conformation dynamics, the identification of metastable states of Markov chains has been subject to extensive research in recent years, especially when the Markov chains represent energy states of biomolecules. Some previous work on this topic involved the computation of the eigenvalue cluster close to one, as well as the corresponding eigenvectors and th...
متن کاملApproximation of word counts in Markov chains
In this talk, we give an overview about the diierent approximation results existing on the statistical distribution of word counts in a Markov chain. Results concerning the number of overlapping occurrences, the number of non-overlapping occurrences (renewals) and the declumped count will be presented. Counts of single words but also multiple words and word families are considered. We will see ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Stochastic Processes and their Applications
سال: 2023
ISSN: ['1879-209X', '0304-4149']
DOI: https://doi.org/10.1016/j.spa.2023.01.018